The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single welch diagram

Reversible cellular automata are discrete dynamical systems based on local interactions which are able to produce an invertible global behavior. Reversible automata have been carefully analyzed by means of graph and matrix tools, in particular the extensions of the ancestors in these systems have a complete representation by Welch diagrams. This paper illustrates how the whole information of a reversible one-dimensional cellular automaton is conserved at both sides of the ancestors for sequences with an adequate length. We give this result implementing a procedure to obtain the inverse behavior by means of calculating and studying a single Welch diagram corresponding with the extensions of only one side of the ancestors. This work is a continuation of our study about reversible automata both in the local and global sense. An illustrative example is also presented

Productivity and international competitiveness of agriculture in the European Union and the United States

This study looks at international competitiveness of agriculture in the European Union and the United States. The most intuitive concept is that of price competitiveness.We calculate relative prices for 11 member states of the European Union and the United States for the period 1973–2002. We assume that markets are perfectly competitive and in long-run equilibrium, so that the observed price always equals average total cost, as measured by the cost dual to the production function. This assumption is used in our calculation of relative competitiveness and productivity gaps between the European Union and the United States and in our decomposition of relative price movements between changes in relative input prices and changes in relative productivity levelsPublicad

Determining a regular language by glider-based structures called phases fi_1 in Rule 110

Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail

Fenoles de interés farmacológico en hojas de vides silvestres (Vitis spp.) de México

Sedentary styles of life, along with inadequate nutritional habits, increase the risk to develop degenerative chronic diseases. Searching for possible alternatives of prevention for those risks, it has been investigated about the quality and nutraceutic properties of several agricultural commodities. The phenols are substances with important functions in vegetal organisms; and moreover they have antioxidants properties in the cellular metabolism of humans and animals. In order to quantify the content of three phenolic acids and a stilbene, it was performed analyses, by high performance liquid chromatography (HPLC-UV/Vis), on metanolic leave extracts of 97 wild grapevines (Vitis spp.) of Puebla, Mexico. Those plants were found growing in their natural environments from 207 to 2175 m. The gallic acid was the most common of the metabolites since it appeared in 96 of the 97 samples, rutin was the second most common substance and it was identified in 80 samples, the caffeic acid appeared in 29 and finally resveratrol only in 14. The leaves of wild grapevines contain diverse antioxidants substances that might have several benefits in the human health; in addition the suitable conservation, maintenance and correct advantage of this plant genus provide environmental services and the balance of ecosystems

Reproducing the cyclic tag system developed by Matthew Cook with Rule 110 using the phases f1_1

This paper implements the cyclic tag system (CTS) in Rule 110 developed by Cook in [1, 2] using regular expressions denominated phases fi_1 [3]. The main problem in CTS is coding the initial condition based in a system of gliders. In this way, we develop a method to control the periodic phases of the strings representing all gliders until now known in Rule 110, including glider guns. These strings form a subset of regular expressions implemented in a computational system to facilitate the construction of CTS. Thus, these phases are useful to establish distances and positions for every glider and then to delineate more sophisticated components or packages of gliders. In this manuscript, it is possible to find differences with the results exposed in Wolfram's book [2], inclusively some mistakes which avoid to obtain an appropriated realization of CTS in Rule 110; fortunately, these irregularities were discussed and clarified by Cook